Approximating the modulus of an inner function
نویسندگان
چکیده
منابع مشابه
On the Mean Modulus of an Analytic Function
For fixed ƒ and r this mean modulus Mt(r;f) as a function of / is continuous, nonnegative, nondecreasing, and is bounded above by the maximum modulus of ƒ on C(r) [l, 2 ] . 1 Therefore the limit of Mt(r;f) exists as /—>0 and /—» oo. This limit is defined to be the mean modulus of ƒ on C(r) of order 0 and of order oo respectively. I t may be shown that the mean modulus of order 0 is the geometri...
متن کاملApproximating the Plenoptic Function
The full plenoptic function describes all of the light passing through some volume of space. This information has at least seven dimensions: a ray of light requires five numbers to locate it (a point in space and a direction), plus wavelength and time. Given a digital representation of the plenoptic function, we can reconstruct arbitrary views of a scene. Unfortunately, adequately sampling the ...
متن کاملApproximating the erfinv function
The inverse error function erfinv is a standard component of mathematical libraries, and particularly useful in statistical applications for converting uniform random numbers into Normal random numbers. This chapter presents a new approximation of the erfinv function which is significantly more efficient for GPU execution due to the greatly reduced warp divergence.
متن کاملan investigation about the relationship between insurance lines and economic growth; the case study of iran
مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...
15 صفحه اولApproximating Spanning Tree with Weighted Inner Nodes
We consider a problem coming from practical applications: finding a minimum spanning tree with both edge weights and inner node (non-leaf node) weights. This problem is NP-complete even in the metric space. We present two polynomial time algorithms which achieve approximation factors of 2.35 ln n and 2(Hn − 1), respectively, where n is the number of nodes in the graph and Hn is the n-th Harmoni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2006
ISSN: 0030-8730
DOI: 10.2140/pjm.2006.228.103